MODA A Framework for Memory Centric Performance Characterization

نویسندگان

  • Sunil Shrestha
  • Chun-Yi Su
  • Amanda White
  • Joseph B. Manzano
  • Andres Marquez
  • John Feo
چکیده

In the age of massive parallelism, the focus of performance analysis has switched from the processor and related structures to the memory and I/O resources. Adapting to this new reality, a performance analysis tool has to provide a way to analyze resource usage to pinpoint existing and potential problems in a given application. This requires (1) memory trace collection with minimal perturbation of the application’s behavior; (2) data management of multiple gigabyte and terabyte size trace files; (3) efficient data analysis and visualization of traces; and (4) the introduction of the target architecture’s memory model into the analysis module for a truly memory-centric view. These features enable an application developer to anticipate algorithmic and structural resource bottlenecks on a small scale before a full scale roll out into production. This paper provides an overview of the Memory Observant Data Analysis (MODA) tool, a memory-centric tool first implemented on the Cray XMT supercomputer along with the solution to above mentioned challenges. Throughout the paper, MODA’s capabilities have been showcased with experiments done on matrix multiply and Graph-500 application codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Performance Model for Unified Parallel C

This research is a performance centric investigation of the Unified Parallel C (UPC), a parallel programming language that belong to the Partitioned Global Address Space (PGAS) language family. The objective is to develop performance modeling methodology that targets UPC but can be generalized for other PGAS languages. The performance modeling methodology relies on platform characterization and...

متن کامل

GoFFish: A Sub-graph Centric Framework for Large-Scale Graph Analytics

Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ...

متن کامل

Centric connectivity index by shell matrices

Relative centricity RC values of vertices/atoms are calculated within the Distance Detour and Cluj-Distance criteria on their corresponding Shell transforms. The vertex RC distribution in a molecular graph gives atom equivalence classes, useful in interpretation of NMR spectra. Timed by vertex valences, RC provides a new index, called Centric Connectivity CC, which can be useful in the topologi...

متن کامل

The homotopy categories of injective modules of derived discrete algebras

We study the homotopy category K(InjA) of all injective A-modules InjA and derived category D(ModA) of the category ModA of all A-modules, where A is finite dimensional algebra over an algebraically closed field. We are interested in the algebra with discrete derived category (derived discrete algebra. For a derived discrete algebra A, we get more concrete properties of K(InjA) and D(ModA). The...

متن کامل

Locality-aware Scheduling and Characterization of Task-based Programs

Modern computer architectures expose an increasing number of parallel features supported by complex memory access and communication structures. Currently used task scheduling techniques perform poorly since they focus solely on balancing computation load across parallel features and remain oblivious to locality properties of support structures. We contribute with locality-aware task scheduling ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012